A branch-and-cut algorithm for an assembly routing problem
نویسندگان
چکیده
منابع مشابه
a branch-and-cut method for a blood inventory-routing problem: a case study
in this paper, for the first time, blood inventory-routing problem (irp) is defined and a mixed integer linear programming formulation is presented. to do so, the concepts of assigned inventory, transfusion to crossmatch ratio, crossmatch release period, older-first policy and order-up-to level inventory policy along with perishability considerations are incorporated into the latest inventory-r...
متن کاملEfficient Formulations and a Branch-and-Cut Algorithm for a Production-Routing Problem
The production-routing problem can be seen as a combination of two well known combinatorial optimization problems: the lotsizing and the vehicle routing problems. The variant considered in this paper consists in designing a production schedule for an uncapacitated plant, replenishment schedules for multiple customers, and a set of routes for a single uncapacitated vehicle starting and ending at...
متن کاملA Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier monitors the inventory of each retailer and determines its replenishment policy, guaranteeing that no stockout occurs at the retailer (Vendor Managed Inventory policy). Every time a retailer is visit...
متن کاملA branch-and-cut algorithm for the hub location and routing problem
We study the hub location and routing problem where we jointly decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and s...
متن کاملA branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Article history: Received 20 November 2009 Accepted 3 January 2011 Available online 8 January 2011
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.10.007